Graph Comparison Meets Alexandrov
نویسندگان
چکیده
Graph comparison is a certain type of condition on the metric space encoded by finite graph. We show that each nontrivial graph implies one Alexandrov’s comparisons. The proof gives complete description graphs with trivial
منابع مشابه
Alexandrov meets Lott–Villani–Sturm
Here I show compatibility of two definition of generalized curvature bounds — the lower bound for sectional curvature in the sense of Alexandrov and lower bound for Ricci curvature in the sense of Lott–Villani– Sturm. Introduction Let me denote by CD[m, κ] the class of metric-measure spaces which satisfy a weak curvature-dimension condition for dimension m and curvature κ (see preliminaries). B...
متن کاملHeat Kernel Comparison on Alexandrov Spaces with Curvature Bounded Below
In this paper the comparison result for the heat kernel on Riemannian manifolds with lower Ricci curvature bound by Cheeger and Yau [CY81] is extended to locally compact path metric spaces (X, d) with lower curvature bound in the sense of Alexandrov and with sufficiently fast asymptotic decay of the volume of small geodesic balls. As corollaries we recover Varadhan’s short time asymptotic formu...
متن کاملRobust Multimodal Graph Matching: Sparse Coding Meets Graph Matching
Graph matching is a challenging problem with very important applications in a wide range of fields, from image and video analysis to biological and biomedical problems. We propose a robust graph matching algorithm inspired in sparsityrelated techniques. We cast the problem, resembling group or collaborative sparsity formulations, as a non-smooth convex optimization problem that can be efficient...
متن کاملPLCTools: Graph Transformation Meets PLC Design
This paper presents PLCTools, a formal environment for designing and simulating programmable controllers. Control models are specified with IEC FBD (Function Block Diagram), and translated into functionally equivalent HLTPNs (High-Level Timed Petri Nets), through MetaEnv, for analysis and simulation and obtained results are presented in terms of suitable animations of FBD blocks. The peculiarit...
متن کاملWhen graph theory meets knot theory
Since the early 1980s, graph theory has been a favorite topic for undergraduate research due to its accessibility and breadth of applications. By the early 1990s, knot theory was recognized as another such area of mathematics, in large part due to C. Adams’ text, The Knot Book. In this paper, we discuss the intersection of these two fields and provide a survey of current work in this area, much...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siberian Mathematical Journal
سال: 2023
ISSN: ['0037-4466', '1573-9260']
DOI: https://doi.org/10.1134/s0037446623030102